#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;
struct High_Int{
	static const int HNmaxn = 30;
	static const int cut = 10000;
	static const int cut_n = 4;
	int a[HNmaxn],n;


	inline void create(int t){
		n=0;
		memset(a,0,sizeof(a));
		while(t){
			a[n++] = t%cut;
			t/=cut;
		}
	}
	inline void create(string t){
		int fr = 0, to = t.length()-1;

		for(n=0;to>=fr;++n,to-=cut_n)
			for(int i= max(fr,to-cut_n+1);i<=to;i++)
				a[n] = a[n]*10+t[i]-'0';
	}
	inline High_Int(int t=0){
		create(t);
	}
	inline High_Int(string t){
		create(t);
	}

	inline void plus(const High_Int& a,const High_Int& b,High_Int& ans){
		ans.clear();
		ans.n = max(a.n,b.n);
		for(int i=0;i<ans.n;i++)
		{
			ans.a[i]+=a.a[i]+b.a[i];
			ans.a[i+1]=ans.a[i]/cut;
			ans.a[i]%=cut;
		}
		if(ans.a[ans.n])ans.n++;
	}

	inline High_Int operator + (const High_Int& t){
		High_Int ans;
		plus(*this,t,ans);
		return ans;
	}
	inline void print(){
		if(!n)
		{
			cout<<0;
			return ;
		}
		cout<<a[n-1];
		for(int i=n-2;i>=0;i--)
			printf("%.04d",a[i]);
	}
	inline void  clear(){
		n=0;
		memset(a,0,sizeof(a));
	}
	inline int toint(){
		int k=0;
		for(int i=0;i<n;i++) k= (k*cut)+a[i];
		return k; 
	}


};




int main(){
	return 0;
}